Empirical Study on Route-Length Efficiency of Road Networks - Spring 2012 VIGRE Project Report

نویسنده

  • Karthik Ganesan
چکیده

What does it mean to say that a physical network (such as a road network, electricity grid, or telephone network) is optimal? Different optimality criteria for different networks have been developed and studied. In the case of road networks connecting cities, an intuitive notion of an “optimal” network is one that provides the shortest routes between any two cities in the network while requiring a minimal total road network length. Some recent theoretical work of Aldous has focused on the properties of optimal random spatial networks (see [6] for an introduction). The mathematical models studied in this work place cities at random positions and the authors examine the tradeoffs between the route-lengths and the total network length as the number of cities in the network tends to ∞. While it is not possible to study the optimality of real-world road networks on an infinite number of cities, [6] introduces two statistics (see Section II for an explanation) that can summarize the inefficiency and total length (representative of a “cost”) of a road network. Using these two statistics to judge optimality of networks, do real road networks come close to being optimal? Previous undergraduate projects (see [4,5]) have attempted to answer this question by collecting road network data via the web and comparing the inefficiency and network length of these real networks to theoretically optimal random networks. These projects looked at networks on the 20 most populated cities within different states in the USA. One issue prevented the projects from analyzing larger networks: the data collection and calculation of the total network length was not fully automated. In this project, we attempt to resolve this issue by writing R programs that perform these two tasks. One program accesses the web and collects detailed information about the routes between any two pairs of cities in the network, while a second program uses the collected data to compute the total network length. Using these two programs, we then examine road networks on the 40 most populated cities within different states in the USA. We also look at the road network on the 200 most populated cities throughout the entire USA.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Route-Length Efficiency Statistic for Road Networks

This note compares some current theoretical mathematical work on spatial networks with data on inter-city road networks within States. In designing a network, a natural constraint is the total length, and a natural objective is to want the route length `(i, j) between typical cities i, j to be not much longer than straight line distance d(i, j). Write r(i, j) = `(i,j) d(i,j) − 1 for the relativ...

متن کامل

Development of a site-specific regression model for assessment of road-header cutting performance of Tabas coal mine based on rock properties

In underground excavation, where the road-headers are employed, a precise prediction of the road-header performance has a vital role in the economy of the project. In this paper, a new model is developed for prediction of the road-header performance using the non-linear multivariate regression analysis. This model is able to estimate the instantaneous cutting rate (ICR) of roadheader based on r...

متن کامل

Developing a Decision Support System to Improve Transportation Planning in Landslide Prone Terrain

Within the past decade, several transportation planning decision support systems that combine heuristic programming techniques with geographic information systems (GIS) technology have been developed to meet forest operation challenges. These decision support systems, however, have not directly addressed the upslope influences of landslides in choosing routes from road networks. This paper prov...

متن کامل

Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol

In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...

متن کامل

Energy Efficiency and Reliability in Underwater Wireless Sensor Networks Using Cuckoo Optimizer Algorithm

Energy efficiency and reliability are widely understood to be one of the dominant considerations for Underwater Wireless Sensor Networks (UWSNs). In this paper, in order to maintain energy efficiency and reliability in a UWSN, Cuckoo Optimization Algorithm (COA) is adopted that is a combination of three techniques of geo-routing, multi-path routing, and Duty-Cycle mechanism. In the proposed alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012